Theorem Prover Support for the Refinement of Stream Processing Functions
نویسندگان
چکیده
In this paper we show how to use the theorem prover Isabelle to provide tool support for Focus a speci cation and veri cation frame work for the stepwise development of distributed systems Focus is em bedded into Isabelle by modeling the basic notion of stream processing functions and by formalizing an appropriate set of assumption commit ment re nement rules Moreover the re nement calculus is proven to be correct within this model The model is based upon the logic HOLCF an extension of higher order logic by the notions of domain theory The well known case study of a production cell is used to evaluate our proof support by mechanically verifying parts of a paper and pencil proof
منابع مشابه
Theorem Prover Support for the Re nement ofStream Processing
In this paper, we show how to use the theorem prover Isabelle to provide tool support for Focus, a speciication and veriication framework for the stepwise development of distributed systems. Focus is embedded into Isabelle by modeling the basic notion of stream processing functions and by formalizing an appropriate set of assumption/ commitment reenement rules. Moreover, the reenement calculus ...
متن کاملCombining Formal Refinement and Model Checking for Real-Time Systems Verification
We present a framework which combines model checking and theorem prover based refinement for the design of real-time systems focusing on the refinement step when annotating the state-oriented model with timing information. Our verification flow starts from a cycle-accurate finite state machine for the RAVEN model checker and present a translation which efficiently transforms the model to the B ...
متن کاملEmbedding the Refinement Calculus in Coq
The refinement calculus and type theory are both frameworks that support the specification and verification of programs. This paper presents an embedding of the refinement calculus in the interactive theorem prover Coq, clarifying the relation between the two. As a result, refinement calculations can be performed in Coq, enabling the interactive calculation of formally verified programs from th...
متن کاملFrom Proposition to Program - Embedding the Refinement Calculus in Coq
The refinement calculus and type theory are both frameworks that support the specification and verification of programs. This paper presents an embedding of the refinement calculus in the interactive theorem prover Coq, clarifying the relation between the two. As a result, refinement calculations can be performed in Coq, enabling the semiautomatic calculation of formally verified programs from ...
متن کاملSupporting ArcAngel in ProofPower
ArcAngel is a specialised tactic language devised to facilitate and automate program developments using Morgan’s refinement calculus. It is especially well-suited for the specification of high-level strategies to derive programs by construction, and equipped with a formal semantics that enables reasoning about tactics. In this paper, we present an implementation of ArcAngel for the ProofPower t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997